Welcome![Sign In][Sign Up]
Location:
Search - branch bound

Search list

[OtherBranch and Bound

Description: Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
Platform: | Size: 27408 | Author: smt | Hits:

[Mathimatics-Numerical algorithmsBRANCH

Description: 分枝定界法,运筹学-branch-and-bound method, and operations
Platform: | Size: 1678 | Author: | Hits:

[Documents分枝定界算法

Description: 分枝定界算法描述,文本形式!-branch-and-bound algorithm description, in text form!
Platform: | Size: 15360 | Author: 王林 | Hits:

[Mathimatics-Numerical algorithmsBRANCH

Description: 分枝定界法,运筹学-branch-and-bound method, and operations
Platform: | Size: 1024 | Author: | Hits:

[OtherLCbb_TSP

Description: LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman- code
Platform: | Size: 59392 | Author: 张强 | Hits:

[Data structs分支限界法_单源最短路径

Description: 算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared
Platform: | Size: 3072 | Author: ddd | Hits:

[Other分支限界法_批处理作业调度

Description: 算法设计中的分支限界法中的批处理作业调度问题的实现,是用VC++编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared
Platform: | Size: 10240 | Author: ddd | Hits:

[Algorithm分支与界法

Description: 图论中使用分支与界法求解旅行商问题,直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
Platform: | Size: 2048 | Author: 谢继晖 | Hits:

[Mathimatics-Numerical algorithms货郎担分枝限界算法图形

Description: 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
Platform: | Size: 4096 | Author: 李宏亮 | Hits:

[Data structsdynamic knapsack

Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.
Platform: | Size: 3072 | Author: 唐海浪 | Hits:

[Data structsmazh

Description: 旅行商问题的算法,采用分枝限界。网上都只有算法描述,没有实现,这里给出了完整实现,并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category.
Platform: | Size: 2048 | Author: 赵刚 | Hits:

[OtherBranch and Bound

Description: Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
Platform: | Size: 27648 | Author: smt | Hits:

[Data structs01package

Description: 背包问题优先队列分枝限界算法 所谓的背包问题,可以描述如下:一个小偷打劫一个保险箱,发现柜子里有N类不同大小与价值的物品,但小偷只有一个容积为M的背包来装东西,背包问题就是要找出一个小偷选择所偷物品的组合,以使偷走的物品总价值最大。这个问题的求解有很多种方法,本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method.
Platform: | Size: 238592 | Author: 王涛 | Hits:

[Data structshuishufa

Description: 用分支限界法求界旅行商问题,用C++语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
Platform: | Size: 185344 | Author: yangyang | Hits:

[Mathimatics-Numerical algorithmsbranch

Description: 运筹学中的分支界定算法,c++代码,可以运行-Define a branch of operations research in algorithms, c++ Code can run
Platform: | Size: 1024 | Author: leoee | Hits:

[Other01beibao

Description: 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Platform: | Size: 22528 | Author: lius | Hits:

[AI-NN-PR750

Description: A branch-and-bound algorithm for asymmetric TSP
Platform: | Size: 14336 | Author: foxman | Hits:

[File Formatbranch-and-cut-algorithm

Description: 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of branch and bound and cutting plane methods.
Platform: | Size: 1384448 | Author: abrahamlau | Hits:

[matlabbranch_algorithm

Description: 利用分支定届算法实现线性混合整数规划模型的求解(MATLAB代码)- using branch algorithm to solve the mixed integer linear programming model (MATLAB code)
Platform: | Size: 8192 | Author: Lizzer Wee | Hits:

[Software Engineeringbranch-bound.ppt

Description: Design and Analysis Algorithm Branch Bound
Platform: | Size: 1519616 | Author: au | Hits:
« 12 3 4 5 6 7 8 9 10 ... 23 »

CodeBus www.codebus.net